Association schemes and permutation groups
ثبت نشده
چکیده
A set of zero-one matrices satisfying (CC1)–(CC4) is called a coherent configuration. It is really a combinatorial object, since the conditions on the matrices can be translated into combinatorial conditions on the binary relations Oi. The coherent configuration formed by the orbital matrices of a permutation group G is the orbital configuration of G. Indeed, a coherent configuration is a partition of Ω2 with some additional properties. So the coherent configurations on Ω inherit an order from the lattice of partitions of Ω2. We say that the coherent configuration A is finer than B (or that B is coarser than A) if each relation in A is a subset of some relation in B . The orbital configuration of a permutation group G is clearly the finest coherent configuration on which G acts as a group of strong automorphisms (preserving all the relations Oi).
منابع مشابه
Coherent configurations, association schemes and permutation groups
Coherent configurations are combinatorial objects invented for the purpose of studying finite permutation groups; every permutation group which is not doubly transitive preserves a non-trivial coherent configuration. However, symmetric coherent configurations have a much longer history, having been used in statistics under the name of association schemes. The relationship between permutation gr...
متن کاملArtemia: a family of provably secure authenticated encryption schemes
Authenticated encryption schemes establish both privacy and authenticity. This paper specifies a family of the dedicated authenticated encryption schemes, Artemia. It is an online nonce-based authenticated encryption scheme which supports the associated data. Artemia uses the permutation based mode, JHAE, that is provably secure in the ideal permutation model. The scheme does not require the in...
متن کاملCrested Products of Association Schemes
In this paper, we define a new type of product of association schemes (and of the related objects, permutation groups and orthogonal block structures), which generalizes the direct and wreath products (which are referred to as “crossing” and “nesting” in the statistical literature.) Given two association schemes Qr for r = 1, 2, each having an inherent partition Fr (that is, a partition whose e...
متن کاملA study of permutation groups and coherent configurations
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iii CHAPTER 1. HISTORICAL BACKGROUND . . . . . . . . . . . . . . . . . 1 1.1 Early Historical Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Resolvent Polynomials . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.3 More Recent Developments . . . . . . . . . . . . . . . . . ....
متن کاملCharacterization of association schemes by equitable partitions
In this paper we deal with equitable partitions of association schemes. We try to generalize a result in group theory and show examples that a generalization of a certain property conjectured for permutation groups does not hold for association schemes. © 2004 Elsevier Ltd. All rights reserved.
متن کاملComputing Isomorphisms of Association Schemes and its Application
Using computers, Hanaki and I were classifying association schemes of small order for a past few years (Hanaki and Miyamoto (1998,1998,2000),Hanaki (1999)). In the present paper we will discuss about computing isomorphisms of association schemes. We compute isomorphisms of an association scheme using its relation matrix defined in the following section. A relation matrix can be seen an adjacenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003